package com.leetcode_Onequestion;

import java.util.Arrays;

/**
 * @Author jsh
 * @Date 2022/4/14 20:20
 * @Version 1.0
 */

public class leetcode_1672 {

    /*
    * 最富有客户的资产总量
    * */
    public int maximumWealth(int[][] accounts) {

        int max = Integer.MIN_VALUE;
        for (int[] account : accounts) {
            max  = Math.max(max, Arrays.stream(account).sum());
        }
        return max;
    }
}
